Genetic Algorithms for the Multiple Travelling Salesman Problem
نویسندگان
چکیده
منابع مشابه
Genetic Local Search Algorithms for the Travelling Salesman Problem
We briefly review previous attempts to generate near-optimal solutions of the Traveling Salesman Problem by applying Genetic Algorithms. Following the lines of Johnson [1990] we discuss some possibilities for speeding up classical Local Search algorithms by casting them into a genetic frame. In an experimental study two such approaches, viz. Genetic Local Search with 2-Opt neighbourhoods and Li...
متن کاملA New Hybrid Parallel Simulated Annealing Algorithm for Travelling Salesman Problem with Multiple Transporters
In today’s competitive transportation systems, passengers search to find traveling agencies that are able to serve them efficiently considering both traveling time and transportation costs. In this paper, we present a new model for the traveling salesman problem with multiple transporters (TSPMT). In the proposed model, which is more applicable than the traditional versions, each city has diffe...
متن کاملPopulation-Based Optimization Algorithms for Solving the Travelling Salesman Problem
The Travelling Salesman Problem or the TSP is a representative of a large class of problems known as combinatorial optimization problems. In the ordinary form of the TSP, a map of cities is given to the salesman and he has to visit all the cities only once to complete a tour such that the length of the tour is the shortest among all possible tours for this map. The data consist of weights assig...
متن کاملNew Genetic Algorithm for the Travelling Salesman Problem
Given a collection of cities and the cost of travel between each pair of them, the traveling salesman problem is to find the cheapest way of visiting all of the cities and returning to starting point. The simplicity of the statement of the problem is deceptive, the traveling salesman problem is one of the most intensely studied problems in computational mathematics and yet no effective solution...
متن کاملGenetic Algorithms for the Traveling Salesman Problem
This paper is a survey of genetic algorithms for t h e traveling salesman problem. Genetic algorithms are randomized search techniques that simulate some of the processes observed i n natural evolution. In this paper, a simple genetic algorithm is introduced, and various extensions are presented to solve t h e traveling salesman problem. Computational results are also repor ted for both random ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2020
ISSN: 2156-5570,2158-107X
DOI: 10.14569/ijacsa.2020.0110768